Generalized weighted tree similarity algorithms for taxonomy trees
نویسندگان
چکیده
منابع مشابه
Generalized weighted tree similarity algorithms for taxonomy trees
Taxonomy trees are used in machine learning, information retrieval, bioinformatics, and multi-agent systems for matching as well as matchmaking in e-business, e-marketplaces, and e-learning. A weighted tree similarity algorithm has been developed earlier which combines matching and missing values between two taxonomy trees. It is shown in this paper that this algorithm has some limitations when...
متن کاملWeighted Partonomy-taxonomy Trees with Local Similarity Measures for Semantic Buyer-seller Match-making
A semantically enhanced weighted tree similarity algorithm for buyer-seller match-making is presented. First, our earlier global, structural similarity measure over (product) partonomy trees is enriched by taxonomic semantics: Inner nodes can be labeled by classes whose partial subsumption order is represented as a taxonomy tree that is used for similarity computation. In particular, the simila...
متن کاملTowards a Weighted-Tree Similarity Algorithm for RNA Secondary Structure
A tree similarity algorithm for RNA (ribonucleic acid) secondary structure comparison is presented. The elements (nucleotides and nucleotide-pairs) of an RNA secondary structure are represented as normalized node-weighted trees. We show that our weighted tree representations of RNA secondary structures are informative and useful. Based on this unique representation for RNA secondary structure, ...
متن کاملA Taxonomy of Minimisation Algorithms for Deterministic Tree Automata
We present a taxonomy of algorithms for minimising deterministic bottomup tree automata (dtas) over ranked and ordered trees. Automata of this type and its extensions are used in many application areas, including natural language processing (nlp) and code generation. In practice, dtas can grow very large, but minimisation keeps things manageable. The proposed taxonomy serves as a unifying frame...
متن کاملGeneralized trees related with tree metrics
Graphs without induced subgraphs of minimum degree at least 3 have been considered in matroid theory (see, e.g., Welsh 1976, ch. 14 or Aigner 1979, ch. 7) and in some domains of applications (Todd 1989, Gu enoche and Leclerc 1999). Maximal such graphs were characterized in Todd's paper. They are called here 2d-trees. A subclass of 2d-trees consists of the classical 2-trees (Pippert and Beineke ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Information Security
سال: 2016
ISSN: 1687-417X
DOI: 10.1186/s13635-016-0035-2